\select@language {french}
\contentsline {section}{\numberline {1}Introduction}{3}
\contentsline {section}{\numberline {2}Organisation}{3}
\contentsline {subsection}{\numberline {2.1}Modules et d\IeC {\'e}pendances}{3}
\contentsline {subsection}{\numberline {2.2}Sommets}{4}
\contentsline {subsection}{\numberline {2.3}Ar\IeC {\^e}tes}{4}
\contentsline {subsection}{\numberline {2.4}Graphe}{5}
\contentsline {subsection}{\numberline {2.5}Affichage}{7}
\contentsline {subsection}{\numberline {2.6}Application principale}{8}
\contentsline {section}{\numberline {3}Algorithmes}{8}
\contentsline {subsection}{\numberline {3.1}Remarque sur le graphe extrait}{8}
\contentsline {subsection}{\numberline {3.2}Compl\IeC {\'e}tion}{9}
\contentsline {subsubsection}{\numberline {3.2.1}Avec les distances euclidiennes}{9}
\contentsline {subsubsection}{\numberline {3.2.2}Avec le plus court chemin}{9}
\contentsline {subsection}{\numberline {3.3}Kruskal : calcul d'un arbre couvrant de poids minimal}{10}
\contentsline {subsubsection}{\numberline {3.3.1}Avec les distances euclidiennes}{11}
\contentsline {subsubsection}{\numberline {3.3.2}Avec le plus court chemin}{11}
\contentsline {section}{\numberline {4}Conclusion}{12}
\contentsline {section}{\numberline {A}Annexe : algorithme de Dijkstra}{13}
\contentsline {section}{\numberline {B}Annexe : algorithme de Kruskal}{14}
